NO分子宏观气体热力学性质的理论研究

采用量子统计系综理论,研究了基态NO分子宏观气体摩尔熵、摩尔内能、摩尔热容等热力学性质.首先应用课题组前期建立的变分代数法(variational algebraic method, VAM)计算获得了基态NO分子的完全振动能级,得到的VAM振动能级作为振动部分,结合欧拉-麦克劳林渐进展开公式的转动贡献,应用于经典的热力学与统计物理公式中,从而计算得到了1000-5000 K温度范围内NO宏观气体的摩尔内能、摩尔熵和摩尔热容.将不同方法计算得到的摩尔热容结果分别与实验值进行比较,结果表明基于VAM完全振动能级获得的结果优于其他方法获得的理论结果.振动部分采用谐振子模型对无限能级求和计算热力学性质的方法有一定的局限性,应当使用有限的完全振动能级进行统计求和.     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

On Potentially Abelian Geometric Representations

The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation

Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.     

凹整数规划的分枝定界解法

凹整数规划是一类重要的非线性整数规划问题，也是在经济和管理中有着广泛应用的最优化问题．本文主要研究用分枝定界方法求解凹整数规划问题，这一方法的基本思想是对目标函数进行线性下逼近，然后用乘子搜索法求解连续松弛问题．数值结果表明，用这种分枝定界方法求解凹整数规划是有效的．     

Numerical analysis of turbulent structure in compound meandering open channel by algebraic Reynolds stress model

The turbulent flow in a compound meandering channel with a rectangular cross section is one of the most complicated turbulent flows, because the flow behaviour is influenced by several kinds of forces, including centrifugal forces, pressure‐driven forces and shear stresses generated by momentum transfer between the main channel and the flood plain. Numerical analysis has been performed for the fully developed turbulent flow in a compound meandering open‐channel flow using an algebraic Reynolds stress model. The boundary‐fitted coordinate system is introduced as a method for coordinate transformation in order to set the boundary conditions along the complicated shape of the meandering open channel. The turbulence model consists of transport equations for turbulent energy and dissipation, in conjunction with an algebraic stress model based on the Reynolds stress transport equations. With reference to the pressure–strain term, we have made use of a modified pressure–strain term. The boundary condition of the fluctuating vertical velocity is set to zero not only for the free surface, but also for computational grid points next to the free surface, because experimental results have shown that the fluctuating vertical velocity approaches zero near the free surface. In order to examine the validity of the present numerical method and the turbulent model, the calculated results are compared with experimental data measured by laser Doppler anemometer. In addition, the compound meandering open channel is clarified somewhat based on the calculated results. As a result of the analysis, the present algebraic Reynolds stress model is shown to be able to reasonably predict the turbulent flow in a compound meandering open channel. Copyright © 2005 John Wiley & Sons, Ltd.     

Oriented Cohomology Theories of Algebraic Varieties

This article contains proofs of the results announced by Panin and Smirnov (http://www. math.uiuc.edu/k-theory/0459/2000) in the part concerning general properties of oriented cohomology theories of algebraic varieties. It is constructed one-to-one correspondences between orientations, Chern structures and Thom structures on a given ring cohomology theory. The theory is illustrated by motivic cohomology, algebraic K-theory, algebraic cobordism theory and by other examples.     

Some alternating sums of Lucas numbers

We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.